On Ramsey (K1, 2, C4)-minimal graphs
نویسندگان
چکیده
For graphs F , G and H , we write F → (G, H) to mean that any red-blue coloring of the edges of F contains a red copy of G or a blue copy of H . The graph F is Ramsey (G, H)-minimal if F → (G, H) but F ∗ 9 (G, H) for any proper subgraph F ∗ ⊂ F . We present an infinite family of Ramsey (K1,2, C4)-minimal graphs of any diameter ≥ 4.
منابع مشابه
All Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کامل1 7 O ct 2 01 7 Projective planes and set multipartite Ramsey numbers for C 4 versus star Claudia
Set multipartite Ramsey numbers were introduced in 2004, generalizing the celebrated Ramsey numbers. Let C4 denote the four cycle and let K1,n denote the star on n + 1 vertices. In this paper we investigate bounds on C4−K1,n set multipartite Ramsey numbers. Relationships between these numbers and the classical C4−K1,n Ramsey numbers are explored. Then several near-optimal or exact classes are d...
متن کاملRamsey Numbers of C4 versus Wheels and Stars
Let ex(n,C4) denote the maximum size of a C4-free graph of order n. For an even integer or odd prime power q > 6, we prove that ex(q2 + q + 2, C4) < 1 2(q+1)(q 2+q+2), which leads to an improvement of the upper bounds on Ramsey numbers R(C4,Wq2+2), where Wn is a wheel of order n. By using a simple polarity graph Gq for a prime power q, we construct the graphs whose complements do not contain K1...
متن کاملWheel and star-critical Ramsey numbers for quadrilateral
The star-critical Ramsey number r∗(H1,H2) is the smallest integer k such that every red/blue coloring of the edges of Kn −K1,n−k−1 contains either a red copy of H1 or a blue copy of H2, where n is the graph Ramsey number R(H1,H2). We study the cases of r∗(C4, Cn) and R(C4,Wn). In particular, we prove that r∗(C4, Cn) = 5 for all n > 4, obtain a general characterization of Ramsey-critical (C4,Wn)...
متن کاملOn the Ramsey number of the quadrilateral versus the book and the wheel
Let G and H be graphs. The Ramsey number R(G, H) is the least integer such that for every graph F of order R(G, H), either F contains G or F contains H . Let Bn and Wn denote the book graph K2 +Kn and the wheel graph K1 + Cn−1, respectively. In 1978, Faudree, Rousseau and Sheehan computed R(C4, Bn) for n ≤ 8. In this paper, we compute R(C4, Bn) for 8 ≤ n ≤ 12 and R(C4, Wn) for 4 ≤ n ≤ 13. In pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 30 شماره
صفحات -
تاریخ انتشار 2010